Efficient Cost Correction of Faulty Overlay Nodes
نویسندگان
چکیده
منابع مشابه
Cost Efficient Upgrading of OPS Nodes
We come back on a technique to build modular switch nodes. This approach allows for a more cost effective expansion of OPS nodes. We give two example designs, showing that the method is useful only for Broadcast & Select OPS nodes when taking price decrease in function of time into account.
متن کاملAdaptive Broadcasting with Faulty Nodes
We consider broadcasting from a fault-free source to all nodes of a completely connected n-node network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes can receive information but cannot send it. Broadcasting is adaptive, i.e. a node...
متن کاملOptimal broadcasting in networks with faulty nodes
Large computer networks are an essential part of modern technology, and quite often information needs to be broadcast to all the computers in the network. If all computers work perfectly all the time, this is simple. Suppose, however, that some of the computers fail occasionally. What is the fastest way to ensure that with high probability all working computers get the information? In this pape...
متن کاملOn Boolean Decision Trees with Faulty Nodes
We consider the problem of computing with faulty components in the context of the Boolean decision tree model, in which cost is measured by the number of input bits queried and the responses to queries are faulty with a xed probability. We show that if f can be represented in k-DNF form and in j-CNF form, then O(n log(min(k; j)=q)) queries suuce to compute f with error probability less than q, ...
متن کاملAggregation Query under Presence of Faulty or Malicious Nodes
Proposes a secure routing protocol tolerant of faulty or malicious nodes. They consider malicious nodes that tries to create routing loops, misdirects packets, or selectively drops packets. Their algorithm detects malicious links after log n faults where n is the length of the path. Since the protocol relies on packet acks to determine whether the node has reached the destination, the applicabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2015
ISSN: 1556-5068
DOI: 10.2139/ssrn.3027586